Recursion operators admitted by non-Abelian Burgers equations: Some remarks
نویسندگان
چکیده
منابع مشابه
Recursion Operators of Some Equations of Hydrodynamic Type
We give a general method for constructing recursion operators for some equations of hydrodynamic type, admitting a nonstandard Lax representation. We give several examples for N = 2 and N = 3 containing the equations of shallow water waves and its generalizations with their first two higher symmetries and their recursion operators. We also discuss a reduction of N + 1 systems to N systems of so...
متن کاملSome remarks on Abelian dominance∗
We used a renormalisation group based smoothing to address two questions related to Abelian dominance. Smoothing enabled us to extract the Abelian heavy-quark potential from time-like Wilson loops on Polyakov gauge projected configurations. We obtained a very small string tension which is inconsistent with the string tension extracted from Polyakov loop correlators. This shows that the Polyakov...
متن کاملRemarks on Non-Abelian Duality
A class of two-dimensional globally scale-invariant, but not conformally invariant, theories is obtained. These systems are identified in the process of discussing global and local scaling properties of models related by duality transformations, based on non-semisimple isometry groups. The construction of the dual partner of a given model is followed through; non-local as well as local versions...
متن کاملNon-polynomial Spline Method for Solving Coupled Burgers Equations
In this paper, non-polynomial spline method for solving Coupled Burgers Equations are presented. We take a new spline function. The stability analysis using Von-Neumann technique shows the scheme is unconditionally stable. To test accuracy the error norms 2L, L are computed and give two examples to illustrate the sufficiency of the method for solving such nonlinear partial differential equation...
متن کاملRemarks on Turbo ASMs for Functional Equations and Recursion Schemes
The question raised in [15] is answered how to naturally model widely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully reflect the common intuitive single-agent understanding of recursion. The argument is illustrated by turbo ASMs for Mergesort and Quicksort. Using turbo ASMs for returning function values allows one to seamlessly in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Computers in Simulation
سال: 2018
ISSN: 0378-4754
DOI: 10.1016/j.matcom.2017.02.001